A Parallel Performance Study of Jacobi-like Eigenvalue Solution
نویسنده
چکیده
In this report we focus on Jacobi like resolution of the eigen-problem for a real symmetric matrix from a parallel performance point of view: we try to optimize the algorithm working on the communication intensive part of the code. We discuss several parallel implementations and propose an implementation which overlaps the communications by the computations to reach a better eeciency. We show that the overlapping implementation can lead to signiicant improvements. We conclude by presenting our future work.
منابع مشابه
An Efficient Jacobi-like Algorithm for Parallel Eigenvalue Computation
A very fast Jacobi-like algorithm for the parallel solution of symmetric eigenvalue problems is proposed. It becomes possible by not focusing on the realization of the Jacobi rotation with a CORDIC processor, but by applying approximate rotations and adjusting them to single steps of the CORDIC i Igorithm, Le., only one angle of the CORDIC angle sequence defines the Jacobi rotation in each step...
متن کاملImproving the parallel performance of a domain decomposition preconditioning technique in the Jacobi-Davidson method for large scale eigenvalue problems
Most computational work in Jacobi-Davidson [9], an iterative method for large scale eigenvalue problems, is due to a so-called correction equation. In [5] a strategy for the approximate solution of the correction equation was proposed. This strategy is based on a domain decomposition preconditioning technique in order to reduce wall clock time and local memory requirements. This report discusse...
متن کاملPerformance of the Block Jacobi Method for the Symmetric Eigenvalue Problem on a Modern Massively Parallel Computer∗
In this paper, we consider the solution of a medium-size symmetric eigenvalue problem on a massively parallel computer using the block Jacobi method. We compare parallel cyclic block Jacobi methods using 1-dimensional and 2-dimensional data distribution and show that the latter has advantages in terms of the number of processors that can be used and the frequency and volume of interprocessor co...
متن کاملSolving Eigenvalue Problems on Networks of Processors
In recent times the work on networks of processors has become very important, due to the low cost and the availability of these systems. This is why it is interesting to study algorithms on networks of processors. In this paper we study on networks of processors different Eigenvalue Solvers. In particular, the Power method, deflation, Givens algorithm, Davidson methods and Jacobi methods are an...
متن کاملEfficient Methods For Nonlinear Eigenvalue Problems Diploma Thesis
During the last years nonlinear eigenvalue problems of the type T (λ)x = 0 became more and more important in many applications with the rapid development of computing performance. In parallel the minmax theory for symmetric nonlinear eigenvalue problems was developed which reveals a strong connection to corresponding linear problems. We want to review the current theory for symmetric nonlinear ...
متن کامل